Exact Algorithms for the Steiner Tree Problem
نویسندگان
چکیده
All rights reserved. No part of this work may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without prior permission from the copyright owner.
منابع مشابه
Computing Optimal Rectilinear Steiner Trees: A Survey and Experimental Evaluation
The rectilinear Steiner tree problem is to nd a minimum-length rectilinear interconnection of a set of points in the plane. A reduction from the rectilinear Steiner tree problem to the graph Steiner tree problem allows the use of exact algorithms for the graph Steiner tree problem to solve the rectilinear problem. Furthermore, a number of more direct, geometric algorithms have been devised for ...
متن کاملDijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
We present a new exact algorithm for the Steiner tree problem in graphs which is based on dynamic programming. Known empirically fast algorithms are primarily based on reductions, heuristics and branching. Our algorithm combines the best known worst-case run time with a fast, often superior, practical performance.
متن کاملRectilinear Full Steiner Tree Generation Rectilinear Full Steiner Tree Generation
The fastest exact algorithm (in practice) for the rectilinear Steiner tree problem in the plane uses a two-phase scheme: First a small but suucient set of full Steiner trees (FSTs) is generated and then a Steiner minimum tree is constructed from this set by using simple backtrack search, dynamic programming or an integer programming formulation. FST generation methods can be seen as problem red...
متن کاملAlgorithms for the Maximum Weight Connected Subgraph and Prize-collecting Steiner Tree Problems
We present new exact and heuristic algorithms for the prizecollecting Steiner tree problem. The exact algorithm rst reduces the size of the input graph while preserving equivalence of the optimal solutions and then uses mixed integer linear programming to solve the resulting instance. For our heuristic, we reduce the size of the instance graph further, but without guaranteeing the equivalence o...
متن کاملRectilinear group Steiner trees and applications in VLSI design
Given a set of disjoint groups of points in the plane, the rectilinear group Steiner tree problem is the problem of nding a shortest intercon-nection (under the rectilinear metric) which includes at least one point from each group. This is an important generalization of the well-known rectilinear Steiner tree problem which has direct applications in VLSI design, i.e., it is the fundamental prob...
متن کاملPrize-Collecting Steiner Tree and Forest in Planar Graphs
We obtain polynomial-time approximation-preserving reductions (up to a factor of 1+ε) from the prizecollecting Steiner tree and prize-collecting Steiner forest problems in planar graphs to the corresponding problems in graphs of bounded treewidth. We also give an exact algorithm for the prize-collecting Steiner tree problem that runs in polynomial time for graphs of bounded treewidth. This, com...
متن کامل